Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
نویسندگان
چکیده
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
منابع مشابه
David S . Johnson Catherine Schevon Lyle a . Mcgeoch Cecilia R . Aragon Optimization by Simulated Annealing : an Experimental Evaluation ; Part Ii , Graph Coloring and Number Partitioning
is minimized, The ch2 natural "neighborhood neighboring solutions (or two elements, have rain, in which neighl tends to dominate tm graphs as the size and/o but was roundly beaten I structure.) In this paper, we c context of two addition natorial optimization number partitioning, T cause they have been stl traditionally been appn the algorithmic template is based, The graph coloring I tions in ...
متن کاملOptimization by Simulated Annealing : an Experimental Evaluation ; Part 1 , Graph Partitioning
In this and two companion papers, we report on an extended empirical study of the simulated annealing approach to combinatorial optimization proposed by S. Kirkpatrick et al. That study investigated how best to adapt simulated annealing to particular problems and compared its performance to that of more traditional algorithms. This paper (Part I) discusses annealing and our parameterized generi...
متن کاملCircuit Partitioning Using Atabu
Tabu Search is a simple combinatorial optimization strategy that has been applied with great success in applications ranging from graph coloring to scheduling and space planning. This paper describes the application of the Tabu Searchh1] heuristic to the circuit partitioning problem. Results obtained indicate that in most cases Tabu Search yields netlist partitions with 10% fewer cut nets than ...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملParallel Simulated Annealing Algorithm for Graph Coloring Problem
The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). Synchronous master-slave model with periodic solution update is being used. The paper contains description of the method, recommendations for optimal parameters settings and summary of results obtained during algorithm’s evalua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Operations Research
دوره 39 شماره
صفحات -
تاریخ انتشار 1991